Tromino Tilings with Pegs via Flow Networks
نویسندگان
چکیده
A tromino tiling problem is a packing puzzle where we are given region of connected lattice squares and want to decide whether there exists the using trominoes with shape an L. In this work study slight variation some positions have pegs each comes hole that can only be placed on top pegs. We present characterization flow networks show (i) linear-time parsimonious reduction maximum-flow problem, (ii) counting number such tilings done in linear-time. The proofs both results contain algorithms then used O(n) time.
منابع مشابه
Faultfree Tromino Tilings of Rectangles
In this paper we consider faultfree tromino tilings of rectangles and characterize rectangles that admit such tilings. We introduce the notion of crossing numbers for tilings and derive bounds on the crossing numbers of faultfree tilings. We develop an iterative scheme for generating faultfree tromino tilings for rectangles and derive the closed form expression for the exact number of faultfree...
متن کاملTromino tilings of domino-deficient rectangles
In this paper I have settled the open problem, posed by J. Marshall Ash and S. Golomb in [4], of tiling an m × n rectangle with L-shaped trominoes, with the condition that 3 |(mn 2) and a domino is removed from the given rectangle. It turns out that for any given m, n ≥ 7, the only pairs of squares which prevent a tiling are {(1,2), (2,2)}, {(2,1), (2,2)}, {(2,3), (2,4)}, {(3,2), (4,2)} and the...
متن کاملHard and Easy Instances of L-Tromino Tilings
In this work we study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, nonetheless, we indentify restrictions to the problem where either it remains NP-complete or it has a polynomial time algorithm. First we show that an aztec diamond of order n always has an L-tromino tiling...
متن کاملCounting Domino Tilings of Rectangles via Resultants
The classical cosine formula for enumerating domino tilings of a rectangle, due to Kasteleyn, Temperley, and Fisher is proved using a combination of standard tools from combinatorics and algebra. For further details see [4].
متن کاملParity and tiling by trominoes
The problem of counting tilings by dominoes and other dimers and finding arithmetic significance in these numbers has received considerable attention. In contrast, little attention has been paid to the number of tilings by more complex shapes. In this paper, we consider tilings by trominoes and the parity of the number of tilings. We mostly consider reptilings and tilings of related shapes by t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2021
ISSN: ['1877-0509']
DOI: https://doi.org/10.1016/j.procs.2021.11.056